A switching for all strongly regular collinearity graphs from polar spaces
نویسندگان
چکیده
منابع مشابه
New strongly regular graphs from switching of edges
By Seidel’s switching, we construct new strongly regular graphs with parameters (276, 140, 58, 84). In this paper, we simplify the known switching theorem due to Bose and Shrikhande as follows. Let G = (V,E) be a primitive strongly regular graph with parameters (v, k, λ, μ). Let S(G,H) be the graph from G by switching with respect to a nonempty H ⊂ V . Suppose v = 2(k − θ1) where θ1 is the nont...
متن کاملDual polar spaces as extremal distance-regular graphs
A new inequality for the parameters of distance-regular graphs is proved. It implies that if there are infinitely many distance-regular graphs with fixed λ,μ, ai and ci containing an induced quadrangle then necessarily ci+1 ≥ 1+(μ−1)ci . As the dual polar graphs show, this inequality is best possible. Some related results are also discussed. © 2003 Elsevier Ltd. All rights reserved.
متن کاملA Distributed Search for Strongly Regular Graphs
It is useful to run computational experiments for many discrete mathematics problems. Many of the remaining open problems require computational resources beyond that of a single researcher. Distributed computing is a way to share computing resources. This work implements a library that provides the features of distributed computing to researchers in a framework specific to a tree-based search.
متن کاملStrongly regular graphs
Strongly regular graphs form an important class of graphs which lie somewhere between the highly structured and the apparently random. This chapter gives an introduction to these graphs with pointers to more detailed surveys of particular topics.
متن کاملDisconnecting strongly regular graphs
In this paper, we show that the minimum number of vertices whose removal disconnects a connected strongly regular graph into non-singleton components, equals the size of the neighborhood of an edge for many graphs. These include blocks graphs of Steiner 2-designs, many Latin square graphs and strongly regular graphs whose intersection parameters are at most a quarter of their valency.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2017
ISSN: 0925-9899,1572-9192
DOI: 10.1007/s10801-017-0741-y